Multicommodity Disconnecting Set Problem
نویسندگان
چکیده
Given a directed network G = (V, A) with positive capacity for each a ∈ A, and a specified set of source-sink pairs of vertices, the objective is to remove a set of arcs with minimum capacity so that the resulting network stops all communication from sources to their respective sinks. We study the facial structure of the polytope associated with the solutions of this problem and identify a general class of facets. We develop two algorithms: a simple cutting plane algorithm and a branch-and-cut algorithm for this problem and present computational results. KeywordsMulti-commodity network flows, Multi-cuts, Set covering problem, Integer programming, Polytope, Facets, Branch-and-cut, Approximation algorithms ∗ Corresponding author’s email: [email protected] International Journal of Operations Research 1813-713X Copyright © 2007 ORSTW
منابع مشابه
A Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملApplication of Tabu Search to a Special Class of Multicommodity Distribution Systems
Multicommodity distribution problem is one of the most interesting and useful models in mathematical programming due to its major role in distribution networks. The purpose of this paper is to describe and solve a special class of multicommodity distribution problems in which shipment of a commodity from a plant to a customer would go through different distribution centers. The problem is t...
متن کاملApplication of Tabu Search to a Special Class of Multicommodity Distribution Systems
Multicommodity distribution problem is one of the most interesting and useful models in mathematical programming due to its major role in distribution networks. The purpose of this paper is to describe and solve a special class of multicommodity distribution problems in which shipment of a commodity from a plant to a customer would go through different distribution centers. The problem is t...
متن کاملA Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
We consider the problem of determining a set of optimal tolls on the arcs of a multicommodity transportation network. The problem is formulated as a bilevel mathematical program where the upper level consists in a firm that raises revenues from tolls set on arcs of the network, while the lower level is represented by a group of users travelling on shortest paths with respect to a generalized tr...
متن کاملFaster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different approach to these problems which yields faster and much simpler algorithms. Our approach also allows us to substitute shortest path computations for min-cost flow computations in computing maximum concurrent flow and min...
متن کامل